Efficient Reformulation of 1-Norm Ranking SVM
نویسندگان
چکیده
منابع مشابه
RV-SVM: An Efficient Method for Learning Ranking SVM
Learning ranking (or preference) functions has become an important data mining task in recent years, as various applications have been found in information retrieval. Among rank learning methods, ranking SVM has been favorably applied to various applications, e.g., optimizing search engines, improving data retrieval quality. In this paper, we first develop a 1-norm ranking SVM that is faster in...
متن کاملEfficient Personalized Search using Ranking SVM
The main problem that the web search currently faces is that search queries are short and ambiguous and thus are unable to meet user needs. To avoid such problems, some search engines suggest terms that are meaningfully related to the submitted queries so that users can choose from the suggestions the ones that reflect their information needs. In this paper, we introduce an effective approach t...
متن کاملRanking efficient DMUs using the infinity norm and virtual inefficient DMU in DEA
In many applications, ranking of decision making units (DMUs) is a problematic technical task procedure to decision makers in data envelopment analysis (DEA), especially when there are extremely efficient DMUs. In such cases, many DEA models may usually get the same efficiency score for different DMUs. Hence, there is a growing interest in ranking techniques yet. The purpose of this paper is ra...
متن کاملLearning Optimal Card Ranking from Query Reformulation
Mobile search has recently been shown to be the major contributor to the growing search market. The key difference between mobile search and desktop search is that information presentation is limited to the screen space of the mobile device. Thus, major search engines have adopted a new type of search result presentation, known as information cards, in which each card presents summarized result...
متن کاملFeature Ranking Using Linear SVM
Feature ranking is useful to gain knowledge of data and identify relevant features. This article explores the performance of combining linear support vector machines with various feature ranking methods, and reports the experiments conducted when participating the Causality Challenge. Experiments show that a feature ranking using weights from linear SVM models yields good performances, even whe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2018
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.2017edp7233